Radiocoloring in planar graphs: Complexity and approximations
نویسندگان
چکیده
The Frequency Assignment Problem (FAP) in radio networks is the problem of assigning frequencies to transmitters, by exploiting frequency reuse while keeping signal interference to acceptable levels. The FAP is usually modelled by variations of the graph coloring problem. A Radiocoloring (RC) of a graphG(V,E) is an assignment function : V → N such that | (u)− (v)| 2, when u, v are neighbors in G, and | (u) − (v)| 1 when the distance of u, v in G is two. The number of discrete frequencies and the range of frequencies used are called order and span, respectively. The optimization versions of the Radiocoloring Problem (RCP) are to minimize the span or the order. In this paper we prove that the radiocoloring problem for general graphs is hard to approximate (unless NP= ZPP) within a factor of n1/2− (for any > 0), where n is the number of vertices of the graph. However, when restricted to some special cases of graphs, the problem becomes easier. We prove that the min span RCP is NP-complete for planar graphs. Next, we provide an O(n ) time algorithm (|V | = n) which obtains a radiocoloring of a planar graph G that approximates the minimum order within a ratio which tends to 2 (where the maximum degree of G). Finally, we provide a fully polynomial randomized approximation scheme (fpras) for the number of valid radiocolorings of a planar graph G with colors, in the case where 4 + 50. © 2005 Elsevier B.V. All rights reserved.
منابع مشابه
On Radiocoloring Hierarchically Specified Planar Graphs: PSPACE-Completeness and Approximations
Hierarchical speci cations of graphs have been widely used in many important applications, such as VLSI design, parallel programming and software engineering. A well known hierarchical speci cation model, considered in this work, is that of Lengauer [9, 10], referred to as L-speci cations. In this paper we discuss a restriction on the Lspeci cations resulting to graphs which we call Well-Separa...
متن کاملRadiocolorings in Periodic Planar Graphs: PSPACE-Completeness and Efficient Approximations for the Optimal Range of Frequencies
The Frequency Assignment Problem (FAP) in radio networks is the problem of assigning frequencies to transmitters exploiting frequency reuse while keeping signal interference to acceptable levels. The FAP is usually modelled by variations of the graph coloring problem. A Radiocoloring (RC) of a graph G(V,E) is an assignment function Λ : V → IN such that |Λ(u) − Λ(v)| ≥ 2, when u, v are neighbors...
متن کاملA 2.66-approximation algorithm for radiocoloring k-level restricted hierarchically specified planar graphs
The huge increase of wireless networks imposed the need of managing very large networks in an efficient way. A usual structure that is utilized towards this goal is the hierarchical structure. We consider the Frequency Assignment Problems in very large networks can be constructed by a set of much smaller netwroks connected to each other in a hierarchical, tree-like way. We focus on planar case,...
متن کاملDistributed Approximation Algorithms for Planar Graphs
In this paper we construct two distributed algorithms for computing approximations of a largest matching and a minimum dominating set in planar graphs on n vertices. The approximation ratio in both cases approaches one with n tending to infinity and the number of synchronous communication rounds is poly-logarithmic in n. Our algorithms are purely deterministic.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 340 شماره
صفحات -
تاریخ انتشار 2005